EPOC: Efficient Probabilistic Public-Key Encryption (Submission to P1363a)
نویسندگان
چکیده
We describe a novel public-key cryptosystem, EPOC (Efficient Probabilistic Public-Key Encryption), which has two versions: EPOC-1 and EPOC-2. EPOC-1 is a public-key encryption system that uses a one-way trapdoor function and a random function (hash function). EPOC-2 is a public-key encryption system that uses a one-way trapdoor function, two random functions (hash functions) and a symmetric-key encryption (e.g., one-time padding and block-ciphers). EPOC has several outstanding properties as follows: 1. EPOC-1 is semantically secure or non-malleable against chosen ciphertext attacks (IND-CCA2 or NM-CCA2) in the random oracle model under the p-subgroup assumption, which is comparable to the quadratic residue and higher degree residue assumptions. 2. EPOC-2 with one-time padding is semantically secure or non-malleable against chosen ciphertext attacks (IND-CCA2 or NM-CCA2) in the random oracle model under the factoring assumption. 3. EPOC-2 with symmetric encryption is semantically secure or non-malleable against chosen ciphertext attacks (IND-CCA2 or NM-CCA2) in the random oracle model under the factoring assumption, if the underlying symmetric encryption is secure against passive attacks. 4. The trapdoor technique with EPOC is fundamentally different from any other previous scheme including RSA-Rabin and Diffie-Hellman-ElGamal. 5. Under the most practical environment in which public-key cryptosystems would be used, the encryption and decryption speeds of EPOC are comparable (several times slower) to those of elliptic curve cryptosystems. Compared with OAEP (RSA) with small e (e.g.,2 + 1), although the encryption speed of EPOC is slower than that of OAEP, the decryption speed is faster than that of OAEP. The encryption scheme described in this contribution is obtained by combining three results: one [25] on the trapdoor function technique is by Okamoto and Uchiyama, and the others [13, 14] on conversion techniques using random functions are by Fujisaki and Okamoto.
منابع مشابه
A User friendly Implementation of EPOC on Windows Environment
EPOC (Efficient Probabilistic Public-Key Encryption) is one of the public-key cryptosystems. It was proposed by Tatsuaki Okamoto, Shigenori Uchiyama, and Eiichiro Fujisaki in NTT in 1998 [4, 6, 7]. EPOC has three versions. In order to provide an easy and convenient graphical user interface, we implemented a GUI of EPOC3 then combined with previously PSEC-KEM and ECDSA on Windows. Through the us...
متن کاملHD{RSA: Hybrid Dependent RSA a New Public-Key Encryption Scheme
This paper describes a new hybrid RSA-based public-key encryption scheme, the HD-RSA. It relies on the recently proposed Dependent{RSA problem, which can be proven as di cult as the original RSA problem, in some circumstances. The basic scheme, using the \one-time pad" symmetric encryption, provides a both very e cient scheme and secure relative to the sole Dependent{RSA problem. A more general...
متن کاملA Proposal for an ISO Standard for Public Key Encryption (version 2.0)
This document should be viewed less as a first draft of a standard for public-key encryption, and more as a proposal for what such a draft standard should contain. It is hoped that this proposal will serve as a basis for discussion, from which a consensus for a standard may be formed. Summary of Changes from version 1.1 (February 13, 2001) to version 2.0 (September 17, 2001) • Some new and quit...
متن کاملSubmission to IEEE P 1363 aHD { RSA : Hybrid Dependent RSAa New Public - Key Encryption
This paper describes a new hybrid RSA-based public-key encryption scheme, the HD-RSA. It relies on the recently proposed Dependent{RSA problem, which can be proven as diicult as the original RSA problem, in some circumstances. The basic scheme, using the \one-time pad" symmetric encryption, provides a both very eecient scheme and secure relative to the sole Dependent{RSA problem. A more general...
متن کاملOn the Security of EPOC and TSH-ESIGN
We submitted a public-key encryption scheme, EPOC, and digital signature scheme, TSH-ESIGN, to IEEE P1363a. The security of EPOC and TSH-ESIGN is based on the intractability of factoring n = pq, where p and q are primes. TSH-ESIGN is also based on the intractability of the approximate e-th root (AERP) assumption, which is the approximate version of the RSA assumption. This draft describes the l...
متن کامل